Level crossing in random matrices: I. Random perturbation of a fixed matrix

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Level Crossing Probabilities I: One-dimensional Random Walks and Symmetrization

Abstract. We prove for an arbitrary one-dimensional random walk with independent increments that the probability of crossing a level at a given time n is O(n). Moment or symmetry assumptions are not necessary. In removing symmetry the (sharp) inequality P (|X+Y | ≤ 1) < 2P (|X−Y | ≤ 1) for independent identically distributed X, Y is used. In part II we shall discuss the connection of this resul...

متن کامل

Random fixed point theorems with an application to a random nonlinear integral equation

In this paper, stochastic generalizations of some fixed point for operators satisfying random contractively generalized hybrid and some other contractive condition have been proved. We discuss also the existence of a solution to a nonlinear random integral equation in Banah spaces.

متن کامل

Random perturbation and matrix sparsification and completion

We discuss general perturbation inequalities when the perturbation is random. As applications, we obtain several new results concerning two important problems: matrix sparsification and matrix completion.

متن کامل

Matrix Decompositions Using sub-Gaussian Random Matrices

In recent years, several algorithms which approximate matrix decomposition have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We present a new algorithm, which achieves with high probability a rank-r SVD approximation of an n × n matrix and derive an error bound that does not depend on the first r singular values. Althou...

متن کامل

Random block matrices and matrix orthogonal polynomials

In this paper we consider random block matrices, which generalize the general beta ensembles, which were recently investigated by Dumitriu and Edelmann (2002, 2005). We demonstrate that the eigenvalues of these random matrices can be uniformly approximated by roots of matrix orthogonal polynomials which were investigated independently from the random matrix literature. As a consequence we deriv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical

سال: 2016

ISSN: 1751-8113,1751-8121

DOI: 10.1088/1751-8121/aa5186